A modified priority based probe algorithm for distributed deadlock detection and resolution

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Modified Priority Based Probe Algorithm for Distributed Deadlock Detection and Resolution

This paper presents a modified priority based probe algorithm for deadlock detection and resolution in distributed database systems. The original priority based probe algorithm was presented by Sinha and Natarajan based on work by Chandy, Misra, and Haas. Various examples are used to show that the original priority based algorithm either fails to detect deadlocks or reports deadlocks which do n...

متن کامل

A Dynamic Priority Based Algorithm for Distributed Deadlock Detection and Resolution

In this paper we develop a distributed algorithm, using probes stamped with dynamic priorities, for detecting deadlocks in the single resource model. The correctness of the algorithm is proven. A dynamic priority is a pair where is a process and is the counter value in when initiates a deadlock detection computation. The pair is called a detector when it is referenced in a process or a resource...

متن کامل

A Wait-Free Probe Algorithm for Distributed Deadlock Detection and Resolution

Edge-chasing is the basis of many deadlock detection algorithms. This method detects a deadlock by propagating special messages called probes along dependency edges. When the initiator of a probe receives the probe back, it knows the existence of a deadlock. Once a deadlock is detected, a special message called token is sent to clean up those probes in the deadlock cycle which, if not removed, ...

متن کامل

Liveness Conditions for a Safe Distributed Deadlock Resolution Algorithm

Although the problem of deadlock detection and resolution in distributed systems has been studied in detail during the last years, it is still an open and difficult problem for all but the simplest models. One of the main difficulties in finding adequate solutions in the Multiple-Request model resides in the need to avoid false deadlock resolutions. In this paper we show a distributed solution ...

متن کامل

Fault-tolerant distributed deadlock detection/resolution

The problem of deadlock detection in a distributed system has been extensively studied in the past few years. Many algorithms on distributed deadlock detection have been proposed under the assumption that the processors and communication in the system are fault-free. However, in an unreliable distributed system, faulty processors may prevent a deadlock detection algorithm from properly detectin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Software Engineering

سال: 1989

ISSN: 0098-5589

DOI: 10.1109/32.21721